An O(nr) algorithm for the Subset-sum Problem - and other balanced knapsack algorithms
نویسنده
چکیده
منابع مشابه
An employee transporting problem
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
متن کاملWorst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
We present on O(n log n) greedy algorithm with a worst-case performance ratio > 4 for the unbounded knapsack problem, an O(n log n) greedy algorithm with a worst-case performance ratio of ~ for the subset-sum problem, and an O(n log n) greedy algorithm with a worst-case performance ratio of ~for the partition problem. These greedy algorithms, in the sense of worst-case performance, are better t...
متن کاملApproximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem
The well-studied 0=1 Knapsack and Subset-Sum Problem are maximization problems that have an equivalent minimization version. While exact algorithms for one of these two versions also yield an exact solution for the other version, this does not apply to -approximate algorithms. We present several -approximate Greedy Algorithms for the minimization version of the 0=1 Knapsack and the Subset-Sum P...
متن کاملEMCSO: An Elitist Multi-Objective Cat Swarm Optimization
This paper introduces a novel multi-objective evolutionary algorithm based on cat swarm optimizationalgorithm (EMCSO) and its application to solve a multi-objective knapsack problem. The multi-objective optimizers try to find the closest solutions to true Pareto front (POF) where it will be achieved by finding the less-crowded non-dominated solutions. The proposed method applies cat swarm optim...
متن کاملOn the Hardness of Subset Sum Problem from Different Intervals
The subset sum problem, which is often called as the knapsack problem, is known as an NP-hard problem, and there are several cryptosystems based on the problem. Assuming an oracle for shortest vector problem of lattice, the low-density attack algorithm by Lagarias and Odlyzko and its variants solve the subset sum problem efficiently, when the “density” of the given problem is smaller than some ...
متن کامل